Integrating Linear Arithmetic into Superposition Calculus
نویسندگان
چکیده
We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting calculus under some finiteness assumptions.
منابع مشابه
Superposition Modulo Linear Arithmetic SUP(LA)
The hierarchical superposition based theorem proving calculus of Bachmair, Ganzinger, and Waldmann enables the hierarchic combination of a theory with full first-order logic. If a clause set of the combination enjoys a sufficient completeness criterion, the calculus is even complete. We instantiate the calculus for the theory of linear arithmetic. In particular, we develop new effective version...
متن کاملSuperposition as a Decision Procedure for Timed Automata
The success of superposition-based theorem proving in first-order logic relies in particular on the fact that the superposition calculus is able to decide well-known classical decidable fragments of first-order logic and has been successful in identifying new decidable classes. In this paper, we extend this story to the hierarchic combination of linear arithmetic and first-order superposition. ...
متن کاملModular Termination and Combinability for Superposition Modulo Counter Arithmetic
Modularity is a highly desirable property in the development of satisfiability procedures. In this paper we are interested in using a dedicated superposition calculus to develop satisfiability procedures for (unions of) theories sharing counter arithmetic. In the first place, we are concerned with the termination of this calculus for theories representing data structures and their extensions. T...
متن کاملSuperposition modulo theory
This thesis is about the Hierarchic Superposition calculus SUP(T) and its application to reasoning in hierarchic combinations FOL(T) of the free first-order logic FOL with a background theory T where the hierarchic calculus is refutationally complete or serves as a decision procedure. Particular hierarchic combinations covered in the thesis are the combinations of FOL and linear and non-linear ...
متن کاملHierarchic Superposition with Weak Abstraction
Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are “reasonably complete” even in the presence of free function symbols ranging into a background theory sort. The hierarchic superposition calculus of Bachmair, Ganzinger,...
متن کامل